منابع مشابه
Circular-arc hypergraphs: Rigidity via Connectedness
A circular-arc hypergraph H is a hypergraph admitting an arc ordering, that is, a circular ordering of the vertex set V (H) such that every hyperedge is an arc of consecutive vertices. An arc ordering is tight if, for any two hyperedges A and B such that ∅ 6 = A ⊆ B 6= V (H), the corresponding arcs share a common endpoint. We give sufficient conditions for H to have, up to reversing, a unique a...
متن کاملApproximate selection theorems with n-connectedness
*Correspondence: [email protected] Department of Mathematics Education, Sehan University, YoungAm-gun, Chunnam 526-702, Korea Abstract We establish new approximate selection theorems for almost lower semicontinuous multimaps with n-connectedness. Our results unify and extend the approximate selection theorems in many published works and are applied to topological semilattices with path-connec...
متن کاملOn Connectedness of Graphs
A graph structure is deened on the Weyl groups. We show that these graphs are connected for Weyl groups of type An for n 4. 1. Introduction. We have deened a graph structure on Weyl groups through the root system associated with them. The planarity and the other properties of such graphs has been studied elsewhere (1] and 2]). The motivation for these graphs come from the method employed in pro...
متن کاملArc Consistency on n-ary Monotonic and Linear Constraints
Many problems and applications can be naturally modelled and solved using constraints with more than two variables Such n ary constraints in particular arithmetic constraints are provided by many nite domain constraint programming systems The best known worst case time complexity of existing algorithms GAC schema for enforcing arc consistency on general CSPs is O ed where d is the size of domai...
متن کاملOn the probability of connectedness
Given a class of structures with a notion of connectedness (satisfying some reasonable assumptions), we consider the limit (as n -+ oc) of the probability that a random (labelled or unlabelled) n-element structure in the class is connected. The paper consists of three parts: two specific examples, N-free graphs and posets, where the limiting probability of connectedness is one-half and the gold...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1948
ISSN: 0002-9947
DOI: 10.1090/s0002-9947-1948-0026327-7